DIMACS Technical Report 2007 - 05 March 2007 Game

نویسندگان

  • Diogo V. Andrade
  • Konrad Borys
  • Vladimir A. Gurvich
چکیده

Given a non-negative integral m × n matrix A : I × J → ZZ+, the game Seki is defined as follows. Two players R and C take turns and it is specified who begins (this player is called the first and the opponent second). By one move a player can either reduce a strictly positive entry of A by 1 or pass. If both players pass then the game results in a draw. Player R (respectively, C) wins if a row (respectively, column) appears whose all entries are equal to 0. If after a move such a row and column appear simultaneously then the player who made this last move is the winner. (We also consider another version, Seki-I, in which this case is defined as a draw.) If neither R nor C can win in A, even being first, then A is called a seki matrix or simply a seki. Furthermore, A is called a complete seki matrix (CSM) if A is a seki and each player must pass, that is, if a player makes an active move then the opponent wins. Seki is a difficult game. We cannot solve it and present only some partial results and conjectures mostly on the CSMs. The game is closely related to the so-called seki (shared life) positions in GO. However, Seki is of independent interest as a combinatorial game. Those readers who do not know how to play GO can still understand the whole paper, except Appendix, where we analise (seki) positions in GO corresponding to some (seki) matrices. Already for 3 × 3 matrices such positions may be difficult even for advanced GO players.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

" - Optimal Solutions to Nonlinear 0 - 1 Integer Programs Using theSubgradient

In the context of the 1993-1994 DIMACS special year on Parallel Computing, a two-day work-shop entitled \Parallel Processing of Discrete Optimization Problems" was held on April 28{29.The workshop featured about twenty invited speakers from Europe and North America. Thisreport containts the abstracts of the talks. A DIMACS volume with complete refereed papersfrom the worksho...

متن کامل

Computational Models for Belief Revision , Group Decision - Making and Cultural Shifts MURI 05 THIRD YEAR REPORT

FORTHCOMING GOVERNMENT REVIEW AND GOVERNMENT PARTICIPANTS: 17 Dec 2007 -at the Massachusetts Institute of Technology. A one-day technical review to be attended by the review team of Dr. Kenneth Boff (formerly Chief Scientist AFRL/HE, currently consultant to AOARD), Dr. Rebecca Goolsby (ONR Program Mgr. & Cultural Anthropologist), Dr. Fariba Fahroo (AFOSR Program Mgr. Computational Mathematics),...

متن کامل

CMDash’07: Technical Report

The CMDASH’07 team follows our past teams CMDash’06, CMDash’05, CMPack’04, CMPack’03, CMPack’02, CMPack’01, CMPack’00, CMTrio’99, and CMTrio’98 [5, 3, 7, 6]. We have continued our research into new ways of modeling the world and maintained our focus on robust behaviors and cooperation. In this paper, we provide an overview of the specific technical components in our team and focus in detail on ...

متن کامل

DIMACS Technical Report 2007 - 11 July 2007 Using Cartoons to Teach Internet Security

While good user education can hardly secure a system, we believe that poor user education can put it at serious risk. The current problem of online fraud is exasperated by the fact that most users make security decisions, such as whether to install a given piece of software or not, based on a very rudimentary understanding of risk. We describe the design principles behind SecurityCartoon.com, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007